A Lamarckian Evolution Strategy for Genetic Algorithms

نویسنده

  • Brian J. Ross
چکیده

A Prolog implementation of a simple Lamarckian evolution module for genetic algorithms is discussed. Lamarckian evolution posits that characteristics acquired during a phenotype's lifetime may be inherited by offspring. Although largely dismissed as a viable evolutionary theory for natural systems, Lamarckian evolution has proven effective within computer applications. The strengths of the implementation discussed here are its speed and simplicity -the latter promoting extensibility and specialization to particular applications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lamarckian Evolution , The Baldwin E ectand Function

We compare two forms of hybrid genetic search. The rst uses Lamarckian evolution, while the second uses a related method where local search is employed to change the tness of strings, but the acquired improvements do not change the genetic encoding of the individual. The latter search method exploits the Baldwin eeect. By modeling a simple genetic algorithm we show that functions exist where si...

متن کامل

Lamarckian Evolution and the Baldwin Effect in Evolutionary Neural Networks

Resumen— Hybrid neuro-evolutionary algorithms may be inspired on Darwinian or Lamarckian evolution. In the case of Darwinian evolution, the Baldwin effect, that is, the progressive incorporation of learned characteristics to the genotypes, can be observed and leveraged to improve the search. The purpose of this paper is to carry out an experimental study into how learning can improve G-Prop gen...

متن کامل

Adding Learning to the Cellular Development of Neural Networks: Evolution and the Baldwin Effect

A grammar tree is used to encode a cellular developmental process that can generate whole families of Boolean neural networks for computing parity and symmetry. The development process resembles biological cell division. A genetic algorithm is used to nd a grammar tree that yields both architecture and weights specifying a particular neural network for solving speciic Boolean functions. The cur...

متن کامل

Logic Aided Lamarckian Evolution

We propose a multi-strategy genetic algorithm for performing belief revision. The algorithm implements a new evolutionary strategy which is a combination of the theories of Darwin and Lamarck. Therefore, the algorithm not only includes the Darwinian operators of selection, mutation and crossover but also a Lamarckian operator that changes the individuals so that they perform better in solving t...

متن کامل

An Application of Lamarckian Evolution Model to Function Optimization

This paper describes an application of Lamarckian Evolution Model (LEM) to function optimization. This model, proposed by Michalski, is inspired by a simple observation that acquisition of patterns or descriptions of the elites in populations and hence guiding the generation of new populations according to learned patterns may lead to a much more effective evolution, in terms of the evolution s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999